package pteam;
public class Tree {
  public static final int NORTH = 0;
  public static final int EAST = 1;
  public static final int SOUTH = 2;
  public static final int WEST = 3;

  public static final int FORWARD = 0;
  public static final int RIGHT = 1;
  public static final int BACKWARD = 2;
  public static final int LEFT = 3;
  
  public static Node root;
  public static Link current;

  
  public static Object[] rotate(Object[] n) {
    Object tmp = n[n.length-1];
    for(int i=n.length-1; i>0; i--) {
      n[i] = n[i-1];
    }
    n[0] = tmp;
    return n;
  }
}